On Convolutional Coupled Codes

On Woven Convolutional Codes

On cyclic convolutional codes

We investigate the notion of cyclicity for convolutional codes as it has been introduced in the papers [15, 18]. Codes of this type are described as submodules of F[z]n with some additional generalized cyclic structure but also as specific left ideals in a skew polynomial ring. Extending a result of [15], we show in a purely algebraic setting that these ideals are always principal. This leads t...

New convolutional codes from old convolutional codes

In this paper, starting with a family of convolutional codes, we construct a new convolutional code and we introduce also necessary and sufficient conditions in order that the new convolutional code is MDS.

On isometries for convolutional codes

In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are certain types of monomial transformations. We will show a form of MacWilliams Equivalence Theorem, that is, each isometry between convolutional codes is given by...

On Negacyclic MDS-Convolutional Codes

New families of classical and quantum optimal negacyclic convolutional codes are constructed in this paper. This optimality is in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search.